Merkle-Hellman Knapsack Cryptosystem in Undergraduate Computer Science Curriculum
نویسندگان
چکیده
We present our experience integrating MerkleHellman knapsack cryptosystem into undergraduate computer science curriculum. The paper focuses on the additive knapsack and ways to integrate it into the following undergraduate computer science courses: introduction to computer science, cryptology, and analysis of algorithms. Ideas for undergraduate student projects are presented and discussed.
منابع مشابه
Performance Analysis of Shamir's Attack on the Basic Merkle-Hellman Knapsack Cryptosystem
In 1978 Merkle and Hellman [11] proposed public key cryptosystems based on the knapsack problem. The simplest of these cryptosystems, the basic knapsack cryptosystem, works as follows. The public information is a set of nonnegative integers { a i : 1 ≤ i ≤ n } which are called knapsack weights. Messages are encrypted by first being broken into blocks (x 1 , ... ,x n ) of n binary digits. A bloc...
متن کاملInteger Programming and Cryptography
Not long ago it was reported m the press that Adi Shamir, from the Weizmann Institute of Science m Israel, had broken one of the first public key cryptosystems, the Merkle-Hellman knapsack System Saentific American (August 1982, p 79) reported maccurately that He did so by provmg that a mathematical problem called the knap sack problem, which had been considered e^ceedmgly dtfficult, am be solv...
متن کاملCryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme
The basic Merkle-Hellman additive trapdoor knapsack public-key cryptosystem was recently shown to be insecure, and attacks have also been developed on stronger variants of it, such as the Graham-Shamir system and the iterated knapsack cryptosystem. This paper shows that some simple variants of another Merkle-Hellman system, the multiplicative knapsack cryptosystem, are insecure. It is also show...
متن کاملAnalytical Observations on Knapsack Cipher 0/255
We observed few important facts that concerns with the new proposal of knapsack cipher 0/255, recently published by Pham [1]. The author claimed that the time complexity for solving new improved trapdoor knapsack is O(256). In this paper, we show that the knapsack cipher 0/255 can be solved in the same time that is required for solving the basic knapsack-cipher proposed by Merkle and Hellman [2...
متن کاملA New Knapsack Public-Key Cryptosystem Based on Permutation Combination Algorithm
A new secure knapsack cryptosystem based on the Merkle-Hellman public key cryptosystem will be proposed in this paper. Although it is common sense that when the density is low, the knapsack cryptosystem turns vulnerable to the low-density attack. The density d of a secure knapsack cryptosystem must be larger than 0 9408 . to avoid low-density attack. In this paper, we investigate a new Permutat...
متن کامل